Prototype Selection for Classification in Standard and Generalized Dissimilarity Spaces
نویسنده
چکیده
A common way to represent patterns for recognition systems is by feature vectors lying in some space. If this representation is based only on the predefined object features, it is independent of the other objects. In contrast, a dissimilarity representation of objects takes into account the relations between them by some measure of resemblance (e.g. dissimilarity). The nearest neighbour (1-NN) is a dissimilarity-based classifier that has shown to be very competitive for several pattern recognition problems. Classification results on dissimilarity spaces spanned by dissimilarities to prototypes can reach or improve the 1-NN results in terms of accuracy and computational efficiency. This is possible if a small set of prototypes is selected with similar discriminative power than the complete set of initial prototypes. How to obtain this set has been studied by researchers in the area of dissimilarity representations and graph representations by means of prototype selection methods. In this chapter we present an overview and a discussion of different approaches proposed in the literature on this topic.
منابع مشابه
Dissimilarity Representations Using lp-norms in Eigen Spaces
This paper presents an empirical evaluation on a dissimilarity measure strategy by which dissimilarity-based classifications (DBC) can be implemented efficiently. In DBC, classification is not based on feature measurements of individual objects (a set of attributes), but rather on a suitable dissimilarity measure among the individual objects (pair-wise object comparisons). One problem of DBC is...
متن کاملTowards Cluster-Based Prototype Sets for Classification in the Dissimilarity Space
The selection of prototypes for the dissimilarity space is a key aspect to overcome problems related to the curse of dimensionality and computational burden. How to properly define and select the prototypes is still an open issue. In this paper, we propose the selection of clusters as prototypes to create low-dimensional spaces. Experimental results show that the proposed approach is useful in ...
متن کاملA Conformal Classifier for Dissimilarity Data
Current classification algorithms focus on vectorial data, given in euclidean or kernel spaces. Many real world data, like biological sequences are not vectorial and often non-euclidean, given by (dis-)similarities only, requesting for efficient and interpretable models. Current classifiers for such data require complex transformations and provide only crisp classification without any measure o...
متن کاملA New Method for Prototype Selection in Dissimilarity Spaces
The dissimilarity representation is a powerful tool for representing objects like images and graphs where the extraction of good features can be difficult, expensive, or impossible. For computing a dissimilarity representation some ingredients are needed, a dissimilarity measure for the problem at hand and a set of prototype objects, that can be selected from the training set. Then, for each ob...
متن کاملExperimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
Prototype-based classification relies on the distances between the examples to be classified and carefully chosen prototypes. A small set of prototypes is of interest to keep the computational complexity low, while maintaining high classification accuracy. An experimental study of some old and new prototype optimisation techniques is presented, in which the prototypes are either selected or gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015